Technical Note—Stopping Rules for Sequencing Problems
نویسندگان
چکیده
منابع مشابه
Technical Appendix for “ Willpower and Personal Rules ”
Pooling: q1 = 1. Then ρ2 = ρ1, while ρ − 2 can be any ρ 0 ≤ ρ. Optimality in (3) then requires ρ1 ≥ ρ∗2 > ρ0, otherwise the right-hand side would be zero. Let therefore ρ1 > ρ∗2 (leaving aside the measure-zero case where ρ1 = ρ ∗ 2). Given that c/βL < C(λ), this is indeed an equilibrium. Semi-separation: q1 ∈ (0, 1). This implies ρ2 ∈ (ρ1, 1) and ρ2 = 0. Furthermore, (3) must now hold with equa...
متن کاملAnalysis and design of sequencing rules for car sequencing
This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximu...
متن کاملA Note on the Optimality of Index Priority Rules for Search and Sequencing Problems
We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an...
متن کاملEffective Sequencing Rules for Closed Manufacturing Networks
This paper develops a method for determining sequencing policies to effectively control a multistation closed queueing network. We assume that several job classes, with different service time distributions, share each server and should be sequenced to maximize the long-run throughput rate of the system. A Brownian control problem that approximates the original queueing network is formulated and...
متن کاملScreening Rules for Convex Problems
This thesis gives a general approach to deriving screening rules for convex optimization problems. It splits up in three steps. As the first step, the Karush-Kuhn-Tucker conditions are used to derive necessary conditions that allow to reduce the problem size. They depend on the optimal solution itself. The second step is to gather information on the optimal solution from a known approximation. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1973
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.21.6.1309